On a Sufficient and Necessary Condition for a Multivariate Polynomial to Have Algebraically Dependent Roots - an Elementary Proof

نویسندگان

  • CSABA VINCZE
  • ADRIENN VARGA
چکیده

In the paper we prove that a multivariate polynomial has algebraically dependent roots iff the coefficients are algebraic numbers up to a common proportional term. A complex analytic proof can be found in [2] with applications in the theory of linear functional equations, see also [3, an open problem, section 4.4] and [1]. Here we present an elementary proof involving cardinality properties and basic linear algebra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some new families of definite polynomials and the composition conjectures

The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

A new result on chromaticity of K4-homoemorphs with girth 9

For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...

متن کامل

Orthogonality Relations for Multivariate Krawtchouk Polynomials

The orthogonality relations of multivariate Krawtchouk polynomials are discussed. In case of two variables, the necessary and sufficient conditions of orthogonality is given by Grünbaum and Rahman in [SIGMA 6 (2010), 090, 12 pages]. In this study, a simple proof of the necessary and sufficient condition of orthogonality is given for a general case.

متن کامل

A Simple Proof of a Conjecture on Univariate Polynomials and Their Roots

We present an elementary proof of the following statement: Let P (x) be a univariate, monic polynomial of degree n with coefficients in some field k of characteristic zero and let P (i) denote its ith derivative. Then P (x) has a common root with each of its derivatives P (i) (1 ≤ i ≤ n− 1) if and only if there exists a ∈ k such that P (x) = (x− a). We can even strengthen the statement by weake...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017